A construction of pairs of non-commutative rank 8 association schemes from non-symmetric rank 3 association schemes
نویسندگان
چکیده
We construct a pair of non-commutative rank 8 association schemes from 3 non-symmetric scheme. For the pair, two have same character table but different Frobenius-Schur indicators. This situation is similar to dihedral group and quaternion order 8. also determine structures adjacency algebras them over rational number field.
منابع مشابه
Non-symmetric 3-class association schemes
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classes and at most 100 vertices. Using computer search, we prove non-existence for three feasible parameter sets. Eleven cases are still open. In the imprimitive case, we survey the known results including some constructions of infinite families of schemes. In the smallest case that has been open up t...
متن کاملAlgorithmic Approach to Non-symmetric 3-class Association Schemes
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classes and at most 100 vertices. Using computer search, we prove non-existence for three feasible parameter sets. Eleven cases are still open. In the imprimitive case, we survey the known results including some constructions of infinite families of schemes. In the smallest case that has been open up t...
متن کاملCommutative association schemes
Association schemes were originally introduced by Bose and his co-workers in the design of statistical experiments. Since that point of inception, the concept has proved useful in the study of group actions, in algebraic graph theory, in algebraic coding theory, and in areas as far afield as knot theory and numerical integration. This branch of the theory, viewed in this collection of surveys a...
متن کاملSchur rings and non-symmetric association schemes on 64 vertices
In this paper we enumerate essentially all non-symmetric association schemes with three classes, less than 96 vertices and with a regular group of automorphisms. The enumeration is based on computer search in Schur rings. The most interesting cases have 64 vertices. In one primitive case and in one imprimitive case where no association scheme was previous known we find several new association s...
متن کاملConstruction of association schemes from difference sets
Let H and F be two finite groups. In group theory it is known that an extension G of H by F is characterized by the action of F on H and a factor set associated with the action, and the twodimensional cohomology group with respect to the action is defined when H is Abelian. In this paper we consider an analogy of the above for association schemes and construct such extensions of association sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2021
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.167